Algebraic connectivity of interdependent networks
نویسندگان
چکیده
منابع مشابه
Robustness and Algebraic Connectivity of Random Interdependent Networks
We investigate certain structural properties of random interdependent networks. We start by studying a property known as r-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and dynamical attacks. We show that random k-partite graphs exhibit a threshold for r-robustness, and that this threshold is the same as the one for the graph to have mi...
متن کاملConnectivity in Interdependent Networks
We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the other graph, and a node fails if all of its supply nodes fail. Such interdependence arises in cyber-physical systems and layered network architectures. We study ...
متن کاملModeling Interdependent Networks as Random Graphs: Connectivity and Systemic Risk
Idealized models of interconnected networks can provide a laboratory for studying the consequences of interdependence in real-world networks, in particular those networks constituting society’s critical infrastructure. Here we show how random graph models of connectivity between networks can provide insights into shifts in percolation properties and into systemic risk. Tradeoffs abound in many ...
متن کاملMaximizing algebraic connectivity in interconnected networks.
Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2014
ISSN: 0378-4371
DOI: 10.1016/j.physa.2014.02.043